A Lower Bound on List Size for List Decoding
نویسندگان
چکیده
منابع مشابه
A Combinatorial Bound on the List Size
We provide a simple, closed-form upper bound for the classical problem of worst case list-size of a general q-ary block code. This new bound improves upon the best known general bound when the alphabet of the code is large. We also show that with parameters of Reed-Solomon codes this bound is very close to the algebraic bound derived using the constructions of the Guruswami-Sudan decoder.
متن کاملA Tight Lower Bound for On-line Monotonic List Labeling
Maintaining a monotonic labeling of an ordered list during the insertion of n items requires (nlog n) individual relabelings, in the worst case, if the number of usable labels is only polynomial in n. This follows from a lower bound for a new problem, preex bucketing.
متن کاملA Probabilistic Lower Bound on the Max- imum Size of a List-of-Two Decodable Code
List decoding of block codes is a decoding strategy which potentially allows better utilization of the error-correction capability of the code being decoded than traditional decoding up to half the minimum distance of the code. The basic idea dates back to 1957 but has fairly recently been the object of renewed interest from the research community, after the development of efficient algorithms ...
متن کاملA New Lower Bound for the List Update
The optimal competitive ratio for a randomized online list update algorithm is known to be at least 1.5 and at most 1.6, but the remaining gap is not yet closed. We present a new lower bound of 1.50084 for the partial cost model. The construction is based on game trees with incomplete information, which seem to be generally useful for the competitive analysis of online algorithms.
متن کاملA Lower Bound for Quantum Search of an Ordered List
It is known that a quantum computer can search an unordered list of N items using O(p N) look-ups, which is quadratically faster than any classical algorithm. We examine the case where the list is ordered, and show that no quantum computer can do with fewer than (p log N = log log N) look-ups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2070170